Automatic updating apparatus, automatic updating method, and programmable storage medium embodying program to perform method for automatic updating

ABSTRACT

An automatic updating apparatus includes a traffic receiver that receives numbers per unit time of the access of more than one menu displayed in a screen and calculates rates of variability with respect to the numbers of the access to each menu, and a menu updating unit that updates a menu display in the screen based on the rates of variability.

INCORPORATION BY REFERENCE

The present application is a Continuation Application of U.S. patentapplication Ser. No. 12/953,607, filed on May 15, 2009, which is basedon Japanese patent application No. 2008-133882, filed on May 22, 2008,the entire contents of which is incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to an automatic updating apparatus, anautomatic updating method and a programmable storage medium embodying aprogram to perform a method for automatic updating and particularly toan automatic updating apparatus, an automatic updating method and aprogrammable storage medium embodying a program to perform a method ofautomatic updating of a web page.

2. Description of Related Art

It is preferable that menus of web pages for enterprises or the like arearranged based on a number of accesses from audiences. That is, it isnecessary to highlight a display item that is frequently accessed amongdisplay items of the menus. Also, there is required to realizehighlighting of the display item frequently accessed as soon aspossible.

Because a frequency at which each of the display items of the menus onthe web page is accessed from the audience changes momentarily, it ispreferable to vary the display order of the display items in quickresponse to the change.

As a related art, a home page menu updating apparatus is disclosed inJP-A-2000-293423.

In JP-A-2000-293423, a user modifies the order of menu items and acharacter attribute for highlighting of the item according to the numberof accesses or the priority by analyzing the access log when the useraccesses to the home page or setting the priority of the menu items, andautomatically updates the menus of the home page so as to always providean optimum menu.

Also, JP-A-2003-006224 discloses an automatic updating method and anautomatic updating apparatus for a WWW page.

In JP-A-2003-006224, a WWW page browsed over a communication network isprovided for each of the audiences, and each WWW page is automaticallyupdated according to the access mode of each audience.

Further, JP-A-2006-323629 discloses a server, a web server, and a pageupdating method which analyze information for updating a page of a webserver.

In JP-A-2006-323629, an access log Data Base (DB) records an accesstime, a number of accesses, a residence time, or the like from a userterminal in each of the web servers, and records a browsing action ofthe user based on the access log that has been recorded in the accesslog DB. A control unit executes a prediction based on a discrete choicemodel, and a prediction based on a co-occurrence frequency with the useof a search keyword according to the obtained browsing action.

Further, in the web page whose contents are frequently updated, it isnecessary to grasp an update of the web page in order to grasp a factorcausing a change in the number of accesses. In recent years, cases haveincreased in which Rich Site Summary (other names: Really SimpleSyndication or RDF Site Summary, hereinafter called “RSS”) is used foran update notification of the web page such as a “blog”.

JP-A-2006-209598 discloses a site information collecting system.

In JP-A-2006-209598, a browse terminal acquires an RSS file from adistribution site by using an RSS reader, and when a Packet INternetGroper (PING) server transmission module exists in the RSS file, thebrowse terminal transmits a Uniform Resource Identifier (URI) of the RSSfile which has been recorded in the PING server transmission module to aPING server designated in the PING server transmission module.

In all of the above, up to now, the display order of display items onthe menus has been changed based on the magnitude of a value of thenumber of accesses from the audiences.

SUMMARY

However, there is no means for changing the display order of displayitems on the menus based on a change in the number of accesses and thevariable ratio.

The present invention proposes a technique of automatically updating themenus of the web page over an Internet to an optimum menu with the useof an access log being within a web server. Specifically, the presentinvention is intended to automatically update the display items in themenus on the web page based on a variation in the number of accesses,respectively.

The present invention seeks to solve one or more of the above problems,or to improve upon those problems at least in part.

In one exemplary embodiment, an automatic updating apparatus accordingto the present invention includes a start instructing unit that outputsan analysis start signal at given intervals, an access count analysisunit that calculates an access count for each of menus indicated in amenu list on a network in response to the analysis start signal,calculates predictive evaluated values based on a variation in theaccess count within a unit time for each of the menus indicated in themenu list, and outputs a start signal unless the predictive evaluatedvalues are arranged in order of the magnitude relation, and a menuupdating unit that acquires the predictive evaluated values according tothe start signal, and updates the contents of the menus indicated in themenu list according to the respective magnitude relations of thepredictive evaluated values.

In another exemplary embodiment, an automatic updating method includesoutputting an analysis start signal at given intervals, calculating anaccess count for each of menus indicated in a menu list on a network inresponse to the analysis start signal, calculating predictive evaluatedvalues based on a variation in the access count within a unit time foreach of the menus indicated in the menu list, and outputting a startsignal unless the predictive evaluated values are arranged in order ofthe magnitude relation, and acquiring the predictive evaluated valuesaccording to the start signal, and updating the contents of the menusindicated in the menu list according to the respective magnituderelations of the predictive evaluated values.

In yet another exemplary embodiment, a programmable storage mediumtangibly embodying a program of machine-readable instructions executableby a digital processing apparatus to perform a method for automaticupdating, the method includes outputting an analysis start signal atgiven intervals, calculating an access count for each of menus indicatedin a menu list on a network in response to the analysis start signal,calculating predictive evaluated values based on a variation in theaccess count within a unit time for each of the menus indicated in themenu list, and outputting a start signal unless the predictive evaluatedvalues are arranged in order of the magnitude relation, and acquiringthe predictive evaluated values according to the start signal, andupdating the contents of the menus indicated in the menu list accordingto the respective magnitude relations of the predictive evaluatedvalues.

Therefore, the menu update of the web page according to a change in thenumber of accesses per unit time can be automatically implemented.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other purposes, advantages and features of the presentinvention will become more apparent from the following description ofcertain exemplary embodiments taken in conjunction with the accompanyingdrawings in which:

FIG. 1 is a block diagram showing a configuration example in a firstexemplary embodiment of the present invention;

FIG. 2 is a block diagram showing a configuration example of an accesscount analysis unit 3 in the first exemplary embodiment;

FIG. 3 is a diagram showing a field configuration example of a datatable in an evaluated value storage unit 5;

FIG. 4 is a flowchart showing a basic operation in the presentinvention;

FIG. 5A is a flowchart showing the operation of the access countanalysis unit 3 in the first exemplary embodiment;

FIG. 5B is a flowchart showing the operation of the access countanalysis unit 3 in the first exemplary embodiment;

FIG. 6 is a diagram showing an example of menu that has not yet beenchanged at time point T2;

FIG. 7 is a diagram showing an example of calculating an evaluated valuein the first exemplary embodiment;

FIG. 8 is a diagram showing an example of the menu that has beenchanged;

FIG. 9 is a block diagram showing a configuration example in a secondexemplary embodiment of the present invention;

FIG. 10 is a block diagram showing a configuration example of an accesscount analysis unit 3 in the second exemplary embodiment;

FIG. 11 is a diagram showing an example of a format of an RSS article;

FIG. 12A is a flowchart showing the operation of the access countanalysis unit 3 in the second exemplary embodiment;

FIG. 12B is a flowchart showing the operation of the access countanalysis unit 3 in the second exemplary embodiment; and

FIG. 13 is a diagram showing an example of calculating an evaluatedvalue in the second exemplary embodiment.

DETAILED DESCRIPTION OF THE EXEMPLARY EMBODIMENTS

The invention will now be described herein with reference toillustrative exemplary embodiments. Those skilled in the art willrecognize that many alternative embodiments can be accomplished usingthe knowledge of the present invention, and that the invention is notlimited to the exemplary embodiments illustrated for explanatorypurposes.

First Exemplary Embodiment Hereinafter, a first exemplary embodiment ofthe present invention will be described with reference to theaccompanying drawings.

Referring to FIG. 1, an automatic updating apparatus according to thefirst exemplary embodiment includes an address input unit 1, a starttimer unit 2, an access count analysis unit 3, an access log storageunit 4, an evaluated value storage unit 5, a menu update unit 6, a webpage definition field storage unit 7, and a web page publication unit 8.

The address input unit 1 accepts an input of an address of a web page.For example, the address input unit 1 accepts the input of the addressof a web page including a menu address 11 to be automatically updated.In this case, the menu address 11 is data indicative of an address ofeach menu indicated on the web page. The menu address 11 is frequentlydescribed in a source code of the web page. In this case, the addressinput unit 1 may acquire the menu address 11 based on the address of theweb page. Alternatively, the address input unit 1 may directly acceptthe input of the menu address 11. Basically, it is assumed that theaddress input in the address input unit 1 is conducted in the samemanner as that in JP-A-2000-293423. However, in fact, the presentinvention is not limited to those examples.

The address input unit 1 may output the address of a preset web page. Atthis time, the address input unit 1 may periodically circulate thesubject web page based on the address of the preset web page, andautomatically acquire the menu address 11 described in the source codeof the subject web page. When target web pages are of plural number, andindividual inputs of addresses are troublesome, the above operation ispreferable.

Also, the address input unit 1 may automatically acquire the addressinput to an application enabling network such as a web browser. At thistime, the address input unit 1 may automatically acquire the menuaddress 11 described in the source code of the subject web page withreference to the web page corresponding to an address input to theapplication.

The start timer unit 2 outputs an analysis start signal 10 at givenintervals. The “given interval” is indicative of a unit time. In thisexample, the start timer unit 2 sets the analysis start signal 10 to“1”, and outputs the signal every one hour. In this case, the unit timeis one hour. In fact, the present invention is not limited to thoseexamples. The analysis start signal 10 is a signal whose active level is“1”. The active level is indicative of “effective”.

Upon receiving the analysis start signal 10, the access count analysisunit 3 acquires the address of the web page, and calculates the numberof accesses with reference to an access log 13 of the web page based onthe acquired address. In this time, the access count analysis unit 3 mayrequire the provision of the menu address 11 of the address input unit 1according to the analysis start signal 10. For example, when theanalysis start signal 10 becomes “1”, the access count analysis unit 3reads the menu address 11 from the address input unit 1, refers to theaccess log 13 corresponding to the menu address 11 from the access logstorage unit 4, and counts the number of accesses.

The access count analysis unit 3 may acquire the address of the web pagefrom the address input unit 1, refer to the web page corresponding tothe acquired address, and automatically acquire the menu address 11described in the source code of the subject web page.

Also, the access count analysis unit 3 predicts and calculates theevaluated value from a change in the number of accesses over time forevery address. For example, the access count analysis unit 3 predictsand calculates the evaluated value from a change in the number ofaccesses over time for every menu address 11, outputs the predicted andcalculated evaluated value as latest evaluated value calculation data14, and stores the data in the evaluated value storage unit 5. Theaccess count analysis unit 3 repeats the above processing until thesubject menu address 11 is eliminated.

Besides, the access count analysis unit 3 outputs a start signal 12 whenthe respective magnitude relations of the predicted and calculatedevaluated values change at the time of analysis. For example, the accesscount analysis unit 3 sets the start signal 12 to “1”, and outputs thesignal when the respective magnitude relations of the predicted andcalculated evaluated values and the evaluated values stored in theevaluated value storage unit 5 are reversed, or the menu changes at thetime of analysis. The start signal 12 is a signal whose value “1” is anactive level.

At this time, the access count analysis unit 3 may initialize the accesslog storage unit 4 after having output the start signal 12, and eraseall of the access logs 13 stored in the access log storage unit 4. Thatis, the access log storage unit 4 may store only the access log 13within the unit time therein.

The access log storage unit 4 stores the access log 13 of the web pagetherein. The access log storage unit 4 may exist on the individual webservers that provide web pages. In this case, the access log storageunit 4 stores the access logs 13 of all of the web pages that can referto the access log 13 with respect to the access count analysis unit 3therein.

The evaluated value storage unit 5 stores the evaluated value that hasbeen predicted and calculated by the access count analysis unit 3.

Upon receiving the start signal 12, the menu update unit 6 acquires theupdated evaluated value (predictive evaluated value), and updates thecontents of the web page according to the order of the evaluated value.For example, when the start signal 12 becomes “1”, the menu update unit6 acquires an updated evaluated value from an evaluated value output 15of the evaluated value storage unit 5, and updates the contents of theweb page including the menu address 11 according to the order of themagnitudes of the evaluated values (magnitude relation).

Also, upon completion of the update, the menu update unit 6 stores thecontents of the web page that has been updated, and outputs a publicsignal 16. For example, upon completion of the update, the menu updateunit 6 stores the contents of the web page that has been updated in theweb page definition field storage unit 7, sets the public signal 16 to“1”, and outputs the signal. The public signal 16 is a signal whosevalue “1” is an active level.

The web page definition field storage unit 7 stores the contents of theweb page that has been updated as the web page definition field.

Upon receiving the public signal 16, the web page publication unit 8publishes the contents of the web page that has been updated. Forexample, when the public signal 16 becomes “1”, the web page publicationunit 8 publishes the contents of the web page definition field that hasbeen stored in the web page definition field storage unit 7 to theinternet.

In this example, a server device that manages the web pages, blogs, andso on is assumed as an example of the automatic updating apparatus. Asexamples of the server devices, a web server, a blog server, an ISP(internet service provider) server, and so on are conceivable. In thisspecification, the server device is not limited to a physical device,but may be of a virtual machine (VM) environment that functions as aserver. In fact, the present invention is not limited to those examples.

As examples of the web pages, individual sites, enterprise sites, newssites, blog sites, download sites, internet sales sites, and the likeare conceivable. In this example, the web page is indicative of a menulist on the network. Accordingly, a list of goods indicated on thedownload sites, the internet sales sites, or the like also correspond to“a menu list on the network”. Also, the menu is not limited to acharacter string, but may be of an image or icons. However, in fact, themenu is not limited to those examples.

As examples of the address input unit 1, a keyboard, a keypad, a keypadon a screen, a touch panel (touch panel), a tablet (tablet), a scanneror a bar code reader which reads a QR code (registered trademark), andthe like are conceivable. Alternatively, the address input unit 1 may bean interface (I/F: interface) that acquires address information from anexternal input device or an external communication device. Also, theaddress input unit 1 may be of a plug-in (plug-in) or a resident programfor automatically acquiring an address input to an application enablinga network such as a web browser. The address input unit 1 is not limitedto one type, but may be plural. However, in fact, the address input unit1 is not limited to those examples.

As examples of the start timer unit 2, the access count analysis unit 3,the menu update unit 6, and the web page publication unit 8, aprocessing unit such as a CPU (central processing unit) or amicroprocessor (microprocessor), or a semiconductor integrated circuit(Integrated Circuit (IC)) having the same function is conceivable. Theaddress input unit 1, the start timer unit 2, the access count analysisnit 3, the menu update unit 6, and the web page publication unit 8 maybe a program for causing a computer to execute the respective functions.However, in fact, those units are not limited to those examples.

As examples of the access log storage unit 4, the evaluated valuestorage unit 5, the menu update unit 6, and the web page definitionfield storage unit 7, a semiconductor storage device such as a memory,an external storage device (storage) such as a hard disk, a storagemedium (media), or the like is conceivable. However, in fact, thoseunits are not limited to those examples.

In the present invention, the access log storage unit 4, the evaluatedvalue storage unit 5, and the web page definition field storage unit 7may be stored in a server, a peripheral device, or the like. In thiscase, the access count analysis unit 3, the menu update unit 6, and theweb page publication unit 8 may access to the server, the peripheraldevice, or the like, and refer to the access log storage unit 4, theevaluated value storage unit 5, and the web page definition fieldstorage unit 7 when executing the respective processing. The accesscount analysis unit 3, the menu update unit 6, and the web pagepublication unit 8 halt a series of processing when they cannot refer tothe access log storage unit 4, the evaluated value storage unit 5, andthe web page definition field storage unit 7.

Subsequently, the configuration example of the access count analysisunit 3 in the first exemplary embodiment will be described withreference to FIG. 2.

The access count analysis unit 3 includes an address comparison unit 31,an evaluated value prediction unit 32, and an evaluated value comparisonunit 33.

The address comparison unit 31 receives the analysis start signal 10,the menu address 11, and the access log 13, and outputs the menu address11 and an access count 311 to the evaluated value storage unit 5. Theaddress comparison unit 31 may output the menu address 11 and the accesscount 311 as one signal. For example, the address comparison unit 31 mayinclude the contents of the access count 311 in the output signal of themenu address 11. Thereafter, the address comparison unit 31 outputs acomparison completion signal (not illustrated). The comparisoncompletion signal may be a flag indicative of comparison completion. Inthis case, the address comparison unit 31 enables the flag indicative ofthe comparison completion instead of outputting a comparison completion,signal.

When T1, T2, and T3 are set in older order of time series, the evaluatedvalue prediction unit 32 inputs the number of accesses at time point T1,the number of accesses at time point T2, and the evaluated value at timepoint T2 from the evaluated value storage unit 5, predicts andcalculates the evaluated value at time point T3 at each menu address 11,and outputs the updated evaluated value (a predictive evaluated value atT3) as latest evaluated value calculation data 14 to the evaluated valuestorage unit 5.

In this example, the evaluated value prediction unit 32 refers to thenumber of accesses at time point T1, the number of accesses at timepoint T2, and the evaluated value at time point T2 from the evaluatedvalue storage unit 5 according to the comparison completion signal fromthe address comparison unit 31. For example, when the evaluated valueprediction unit 32 receives or detects the comparison completion signalfrom the address comparison unit 31, or when the flag indicative of thecomparison completion is enabled, the evaluated value prediction unit 32determines that the access request to the evaluated value storage unit 5is accepted, accesses to the evaluated value storage unit 5, and refersto the number of accesses at time point T1, the number of accesses attime point T2, and the evaluated value at time point T2. In this case,the evaluated value prediction unit 32 may acquire the number ofaccesses at time point T1, the number of accesses at time point T2, andthe evaluated value at time point T2 from the evaluated value storageunit 5.

Now, an example of a formula for calculation of the updated evaluatedvalue will be described.

When T1, T2, and T3 are set in older order of time series, the formulafor calculation of the updated evaluated value (predictive evaluatedvalue) can be represented as follows.

Formula for calculation:(evaluated value at time point T1)+((the number of accesses at timepoint T2)−(the number of accesses at time point T1))/(T2−T1)−(evaluatedvalue at time point T2)(evaluated value at time point T2)+((the number of accesses at timepoint T3)−(the number of accesses at time point T2))/(T3−T2)−(predictiveevaluated value at time point T3)

In the first exemplary embodiment, because the respective intervals ofT1, T2, and 13 are unit time, T1, 12, and T3 are arranged at regularintervals. That is, (T3−T2)=(T2−T1)=unit time is satisfied.

In this example, it is assumed that the number of accesses at time pointT3 is the number of predictive accesses at T3. In this case, the formulafor calculation of the number of accesses at time point 13 can berepresented as follows.

Formula for calculation:(the number of accesses at time point T3)−(the number of accesses attime point T2)+((the number of accesses at time point T2))−(the numberof accesses at time point T1))

Accordingly, the formula for calculation of the updated evaluated value(predictive evaluated value at T3) can be represented as follows.

Formula for calculation:(evaluated value at time point T2)+((the number of accesses at timepoint T2)−(the number of accesses at time point T1))/(T2−T1)−(predictiveevaluated value at time point T3)

The evaluated value comparison unit 33 inputs the evaluated value output15 from the evaluated value storage unit 5, refers to the updatedevaluated value included in the evaluated value output 15, and sets thestart signal 12 to “1”, and outputs the signal when detecting thereversal of the evaluated value. For example, when the updated evaluatedvalue is not arranged in ascending order or in descending order, theevaluated value comparison unit 33 determines that the evaluated valueis reversed, sets the start signal 12 to “1”, and outputs the signal.

Subsequently, a field configuration example of the data table in theevaluated value storage unit 5 will be described with reference to FIG.3.

The evaluated value storage unit 5 includes a menu address storagefield, a first access count storage field, a first evaluated valuestorage field, a second access count storage field, a second evaluatedvalue storage field, and an updated evaluated value storage field. Thefirst access count storage field stores information indicative of thenumber of accesses at time point T1. The first evaluated value storagefield stores information indicative of the evaluated value at time pointT1. The second access count storage field stores information indicativeof the number of accesses at time point T2. The second evaluated valuestorage field stores information indicative of the evaluated value attime point T2. The updated evaluated value storage field storesinformation indicative of the updated evaluated value. The first accesscount storage field, the first evaluated value storage field, the secondaccess count storage field, the second evaluated value storage field,and the updated evaluated value storage field are associated with eachother for each of the menu addresses 11.

Subsequently, the basic operation in the present invention describedwith reference to FIG. 4.

-   (1) Step S101

When the analysis start signal 10 becomes the access comparison unit 31refers to (reads) the access log 13, counts accesses to the menu address11, and calculates the number of accesses.

-   (2) Step S102

Upon completion of reading the access log 13, the access comparison unit31 stores the menu address 11 and the number of accesses 311 in theevaluated value storage unit 5.

-   (3) Step S103

When T1, T2, and T3 are set in older order of time series, the evaluatedvalue prediction unit 32 inputs the number of accesses (first accesscount storage field) at time point T1, the number of accesses (secondaccess count storage field) at time point T2, and the evaluated value(second evaluated value storage field) at time point T2 from theevaluated value storage unit 5, predicts and calculates the evaluatedvalue at time point T3 at each menu address 11 based on the formula forcalculation, outputs the updated evaluated value (a predictive evaluatedvalue at T3) as latest evaluated value calculation data 14, and storesthe updated evaluated value (predictive evaluated value at T3) in theupdated evaluated value storage field of the evaluated value storageunit 5.

-   (4) Step S104

The evaluated value comparison unit 33 reads the updated evaluated valuestorage field of the evaluated value storage unit 5, and sets the startsignal 12 to “1”, and outputs the signal when the reversal of evaluatedvalue is detected. In this example, when the updated evaluated value isnot arranged in descending order or in ascending order, the evaluatedvalue comparison unit 33 determines that the evaluated value isreversed, sets the start signal 12 to “1”, and outputs the signal.Alternatively, the evaluated value comparison unit 33 can compare theorder of arrangement of the existing menus with the order of arrangementof the menus based on the magnitude relation of the updated evaluatedvalue, and can set the start signal 12 to “1”, and can output the signalwhen the order of arrangement of the respective menus is different fromeach other.

The operation of the access count analysis unit 3 in the first exemplaryembodiment will be described with reference to FIGS. 5A and 5B.

-   (1) Step S201

The access count analysis unit 3 confirms whether the analysis startsignal 10 is output at an active level from the start timer unit 2, ornot. At this time, the access count analysis unit 3 monitors theanalysis start signal 10 until the analysis start signal 10 is output atthe active level if the analysis start signal 10 is not output at theactive level from the start timer unit 2.

-   (2) S202

The access count analysis unit 3 reads the access log 13 from the accesslog storage unit 4, and calculates the number of accesses for each ofthe menu addresses 11 if the analysis start signal 10 is output at theactive level from the start timer unit 2 (i.e., “Yes” in step 201).

-   (3) Step S203

The access count analysis unit 3 confirms whether the time integrationvalue of the number of accesses of the menu address 11 read from theaddress input unit 1 increases, or not.

-   (4) Step S204

The access count analysis unit 3 increases the evaluated value when thetime differential value of the number of accesses to the menu address 11increases.

-   (5) Step S205

The access count analysis unit 3 decreases the evaluated value when thetime differential value of the number of accesses to the menu address 11does not increase (e.g., decreases or equal).

-   (6) Step S206

The access count analysis unit 3 calculates the evaluated value in eachof the menu addresses 11, and stores the calculated evaluated value inthe evaluated value storage unit 5. At this time, the access countanalysis unit 3 outputs the evaluated value calculated in each of themenu addresses 11 to the evaluated value storage unit 5 as the latestevaluated value calculation data 14.

-   (7) Step S207

The access count analysis unit 3 confirms whether the menu address 11whose evaluated value is to be calculated remains, or not. When the menuaddress 11 whose evaluated value is to be calculated remains (i.e.,“Yes” in step S207), the access count analysis unit 3 confirms whetherthe menu address 11 whose evaluated value is to be calculated remains,or not. When the menu address 11 whose evaluated value is to becalculated remains, the access count analysis unit 3 confirms whetherthe time differential value of the number of accesses to the subjectmenu address 11 increases, or not, and repeats the above processinguntil the menu address 11 whose evaluated value is to be calculated iseliminated.

-   (8) Step S208

When the menu address 11 whose evaluated value is to be calculated doesnot remain (i.e., “No” in step S207), the access count analysis unit 3predicts and calculates the evaluated value at time point T3 of therespective menu addresses 11, outputs the updated evaluated value(estimated evaluated value at T3) as the latest evaluated valuecalculation data 14, and stores the updated evaluated value (predictiveevaluated value at T3) in the updated evaluated value storage field ofthe evaluated value storage unit 5. In this example, the evaluated valueprediction unit 32 predicts and calculates the evaluated value at timepoint T3 of the respective menu addresses 11, outputs the updatedevaluated value (estimated evaluated value at T3) as the latestevaluated value calculation data 14, and stores the updated evaluatedvalue (predictive evaluated value at T3) in the updated evaluated valuestorage field of the evaluated value storage unit 5.

-   (9) Step S209

The access count analysis unit 3 confirms whether the reversal of thepredictive evaluated value has been detected, or not. When the reversalof the predictive evaluated value has not been detected (i.e., “No” instep S209), the access count analysis unit 3 completes its processing.In this example, the evaluated value comparison unit 33 confirms whetherthe reversal of the predictive evaluated value has been detected, ornot. The reversal of the predictive evaluated value is directed to astate in which the predictive evaluated value is not arranged in ordercorresponding to the magnitude relation.

-   (10) Step S210

When the reversal of the predictive evaluated value has been detected(i.e., “Yes” in step S209), the access count analysis unit 3 sets thestart signal 12 to an active level, and outputs the signal. In thisexample, the evaluated value comparison unit 33 sets the start signal 12to value “1” being the active level, and outputs the signal.

-   (11) Step S211

The menu update unit 6 reads the evaluated value output 15 from theevaluated value storage unit 5, rearranges the menu in order of theevaluated values, stores the updated web page in the web page definitionfield storage unit 7, and outputs the public signal 16 as “1” (i.e., theactive level) to the web page publication unit 8.

-   (12) Step S212

The web page publication unit 8 publishes the contents of the web pagedefinition field storage unit 7 on the network because the publishsignal 16 is “1” (i.e., the active level).

The menu that has not yet been updated at time point T2 will bedescribed with reference to FIG. 6.

In this case, an example of the menus related to a general-purposemicrocomputer will be described. As an example of the general-purposemicrocomputer, an 8-bit 78KOS microcomputer is assumed. As an example oftitles of the menu related to the general-purpose microcomputer,“78KOS/KU1+”, “78KOS/KY1+”, “78KOS/KA1+”, and “78KOS/KB1+” areindicated. In this case, the menu address of “78kOskulplus.html”corresponds to “78KOS/KU1+”. The menu address of “78kOskylplus.html”corresponds to “78KOS/KY1+”. The menu address of “78kOskalplus.html”corresponds to “78KOS/KA1+”

The menu address of “78 kOskblplus.html” corresponds to “78KOS/KB1+”.However, in fact, the present invention is not limited to thoseexamples.

An example of calculating the evaluated value in the first exemplaryembodiment will be described with reference to FIG. 7. In this example,(T2−T1)−(T3−T2)=1 hour is assumed. Also, it is assumed that the numberof accesses at T3 is (the number of accesses at time pointT2)+(difference in the number of accesses of (T2−T1)). In this case, theaccess count analysis unit 3 calculates the respective predictiveevaluated values of “78KOS/KU1+”, “78KOS/KY1+”, “78KOS/KA1+”, and“78KOS/KB1+” as follows.

-   (1) “78KOS/KU1+”

The number of accesses at time point T1=400, the number of accesses attime point T2=450, and the number of accesses at time point T3=500.

It is assumed that the evaluated value at time point T1 is 200.

The evaluated value at time point T2: 200+(450−400)/(T2−T1)=250

The evaluated value at time point T3: 250+(500−450)/(T3−T2)=300

-   (2) “78KOS/KY1+”

The number of accesses at time point T1=200, the number of accesses attime point T2=400, and the number of accesses at time point T3=600.

It is assumed that the evaluated value at time point T1 is 50.

The evaluated value at time point T2: 50+(400−200)/(T2−T1)=250

The evaluated value at time point T3: 250+(400−200)/(T3−T2)−450

Because an increase in the evaluated value of “78KOS/KY1+” exceeds anincrease in the evaluated value of “78KOS/KU1+”, the reversal of theevaluated value can be expected at timing of T3. In this time, the menuchange is implemented at timing of Step S210 in FIG. 5B.

-   (3) “78KOS/KA1+”

The number of accesses at time point T1=150, the number of accesses attime point T2=140, and the number of accesses at time point T3−130.

It is assumed that the evaluated value at time point T1 is 40.

The evaluated value at time point T2: 40+(140−150)/(T2−T1)=30

The evaluated value at time point T3: 30+(130−140)/(T3−T2)=20

-   (4) “78KOS/KB1+”

The number of accesses at time point T1=100, the number of accesses attime point T2=120, and the number of accesses at time point T3=140.

It is assumed that the evaluated value at time point T1 is 10.

The evaluated value at time point T2: 10+(120−100)/(T2−T1)=30

The evaluated value at time point T3: 30+(140−120)/(T3−T2)=50

Because an increase in the evaluated value of “78KOS/KB1+” exceeds anincrease in the evaluated value of “78KOS/KA1+”, the reversal of theevaluated value can be expected at timing of T3. In this time, the menuchange is implemented at timing of Step S210 in FIG. 5B.

The menu that has been changed will be described with reference to FIG.8.

As shown in FIG. 7, when the reversal of the evaluated value occurs, theaccess count analysis unit 3 replaces “78KOS/KU1+” and “78KOS/KY1+” witheach other to rearrange the menu address of “78kOskulplus.html” and themenu address of “78kOskylplus.html”. Similarly, the access countanalysis unit 3 replaces “78KOS/KA1+” and “78KOS/KB1+” with each otherto rearrange the menu address of “78kOskalplus.html” and the menuaddress of “78kOskblplus.html”. However, in fact, the menu is notlimited to those examples.

Second Exemplary Embodiment

Hereinafter, a second exemplary embodiment of the present invention willbe described.

In the second exemplary embodiment, an RSS article is retrieved from anexternal PING server, and the number of coincidences of the browseUniform Resource Locator (URL) with the menu address is added to theevaluated value. In this example, the menu address as a keyword iscompared with the browse URL.

That is, the number of coincidences of the browse URL field with a givenkeyword is added to the evaluated value. The PING server is a serverthat receives and collects RSS information transmitted from therespective blogs. The RSS information mainly includes update informationsuch as blogs.

Referring to FIG. 9, an automatic updating apparatus according to thesecond exemplary embodiment includes an address input unit 1, a starttimer unit 2, an access count analysis unit 3, an access log storageunit 4, an evaluated value storage unit 5, a menu update unit 6, a webpage definition field storage unit 7, a web page publication unit 8, andan RSS collection unit 9.

The address input unit 1, the start timer unit 2, the access countanalysis unit 3, the access log storage unit 4, the evaluated valuestorage unit 5, the menu update unit 6, the web page definition fieldstorage unit 7, and the web page publication unit 8 are basicallyidentical with those in the first exemplary embodiment. In the secondexemplary embodiment, the access count analysis unit 3 further analyzesthe number of RSS articles taken by another site such as a blog, andcalculates the evaluated value.

The RSS collection unit 9 acquires an RSS article 17 from the PINGserver, and supplies the RSS article 17 to the access count analysisunit 3. In this case, the access count analysis unit 3 acquires the RSSarticle 17 from the RSS collection unit 9 in synchronism with theanalysis start signal 10. At this time, the RSS collection unit 9 maysupply the RSS article 17 to the access count analysis unit and maystart the collection of a subsequent RSS article 17 since a time pointwhen the RSS article 17 is possessed by the RSS collection unit 9 iseliminated, and may supply the collected RSS article 17 thereto whenagain receiving a request for the RSS article 17 from the access countanalysis unit 3. As a result, the RSS collection unit 9 can supply onlythe RSS article 17 within the unit time to the access count analysisunit 3.

As an example of the RSS collection unit 9, an RSS reader or the like isconceivable. The RSS collection unit 9 may be a PING server per se.However, in fact, the present invention is not limited to thoseexamples.

As an example of the RSS article 17, an RSS field, an Atom field, amicro format such as hReview, or the like is conceivable. However, infact, the present invention is not limited to those examples.

Subsequently, a description will be given of a configuration example ofthe access count analysis unit 3 according to the second exemplaryembodiment with reference to FIG. 10.

The access count analysis unit 3 includes an address comparison unit 31,an evaluated value prediction unit 32, an evaluated value comparisonunit 33, and an RSS comparison unit 34.

The address comparison unit 31 receives the analysis start signal 10,the menu address 11, and the access log 13, and outputs the menu address11 and an access count 311 to the evaluated value storage unit 5.

When T1, T2, and T3 are set in older order of time series, the evaluatedvalue prediction unit 32 receives the number of accesses at time pointT1, the number of accesses at time point T2, and the evaluated value attime point T2 from the evaluated value storage unit 5, as well asreceives the processing result of the RSS comparison unit 34, predictsand calculates the evaluated value at time point T3 at each menu address11, and outputs the updated evaluated value (a predictive evaluatedvalue at T3) as latest evaluated value calculation data 14 to theevaluated value storage unit 5.

The evaluated value comparison unit 33 receives the evaluated valueoutput 15 from the evaluated value storage unit 5, sets the start signal12 to “1”, and outputs the signal.

The RSS comparison unit 34 receives the menu address 11 and the RSSarticle 17, and outputs the processing result to the evaluated valueprediction unit 32. In this case, the RSS comparison unit 34 calculatesthe number of common RSS articles 17. For example, the RSS comparisonunit 34 compares the browse URL within the RSS article 17 with a keywordassociated with the menu address 11, and counts up the number of commonarticles when the browse URL and the keyword are coincident with eachother.

That is, the number of common articles is indicative of the number ofbrowse URLs related to the same contents. After the RSS comparison unit34 has completely compared the browse URL with the subject keyword forall of menu addresses 11, the RSS comparison unit 34 outputs the numberof common articles as the processing results to the evaluated valueprediction unit 32.

It is preferable that the keyword is associated with the menu address11. However, in fact, the keyword may not be associated with the menuaddress 11, but may be a character string most used within the RSSarticle 17. In this case, the RSS comparison unit 34 detects thecharacter string most used within the RSS article 17, and compares thedetected character string with the browse URL.

At this time, it is preferable that the RSS comparison unit 34 refersto, when receiving the RSS article 17, the site update time field withinthe RSS article 17 in each of the menu addresses 11, and conducts theabove processing on only the RSS article 17 whose update time is withinthe unit time during analysis. For example, the RSS comparison unit 34compares the browse URL with a given keyword in each of the menuaddresses 11 for only the RSS article 17 whose update time is between T1and T2, and counts up the number of common articles when the browse URLis coincident with the given keyword.

In the second exemplary embodiment, the evaluated value prediction unit32 predicts and calculates the updated evaluated value (predictiveevaluated value) by further addition of the number of common articleswhen predicting and calculating the evaluated value at time point T3 ineach of the menu address 11.

Now, an example of calculating the updated evaluated value will bedescribed.

When T1, T2, and T3 are in older order of time series, a formula forcalculation of the updated evaluated value (predictive evaluated valueat T3) can be represented as follows.

Formula for calculation:(evaluated value at time point T1)+((the number of accesses at timepoint T2)−(the number of accesses at time point T1))/(T2−T1)=(evaluatedvalue at time point T2)(evaluated value at time point T2)+((the number of accesses at timepoint T3)−(the number of accesses at time point T2))/(T3−T2)+the numberof common articles=(predictive evaluated value at time point T3)

In the second exemplary embodiment, because the respective intervals ofT1, T2, and T3 are unit time, T1, T2, and T3 are arranged at regularintervals. That is, (T3−T2)=(T2−T1)=unit time is satisfied.

In this example, it is assumed that the number of accesses at time pointT3 is the number of predictive accesses at T3. In this case, the formulafor calculation of the number of accesses at time point T3 can berepresented as follows.

Formula for calculation:(the number of accesses at time point T3)=(the number of accesses attime point T2)+((the number of accesses at time point T2))−(the numberof accesses at time point T1)

Accordingly, the formula for calculation of the updated evaluated value(predictive evaluated value at T3) can be represented as follows.

Formula for calculation:(evaluated value at time point T2)+((the number of accesses at timepoint T2)−(the number of accesses at time point T1))/(T2−T1)+the numberof common articles=(predictive evaluated value at time point T3)

An example of a format of the RSS article 17 will be described withreference to FIG. 11.

The RSS article 17 includes “UR1”, “title”, “URL of browse information”,“details”, “category”, “sub-category”, “keyword”, “site update time”,“receive time”, and so on. In the second exemplary embodiment, the RSScomparison unit 34 compares the respective “browse information URLs” ofa plurality of RSS articles 17 with each other. In this example, “URI”is a URI field that stores URI specifying the location of the blog siteper se. The “browse information URL” is a browse URL field that storesthe browse URL indicative of the location of information on theindividual blog articles appearing on the blog site. Basically, the RSSarticle 17 is identical with the summary data of the RSS file formatdisclosed in JP-A-2006-209598. However, in fact, the present inventionis not limited to those examples.

The operation of the access count analysis unit 3 according to thesecond exemplary embodiment will be described with reference to FIGS.12A and 12B.

-   (1) Step S301

The access count analysis unit 3 confirms whether the analysis startsignal 10 is output at an active level from the start timer unit 2, ornot. In this time, the access count analysis unit 3 monitors theanalysis start signal 10 until the analysis start signal 10 is output atthe active level if the analysis start signal 10 is not output at theactive level from the start timer unit 2.

-   (2) Step S302

The access count analysis unit 3 reads the access log 13 from the accesslog storage unit 4, and calculates the number of accesses for each ofthe menu addresses 11 if the analysis start signal 10 is output at theactive level from the start timer unit 2 (i.e., “Yes” in step S301). Atthe same time, the access count analysis unit 3 compares the browse URLfield within the RSS article 17 with a given keyword for each of themenu addresses 11, and counts up when the browse URL field and the givenkeyword are coincident with each other. In this case, the RSS comparisonunit 34 compares the browse URL field within the RSS article 17 with akeyword associated with the menu address 11, counts up the number ofcommon articles when the browse URL and the subject keyword arecoincident with each other, and adds the number of common articles whenpredicting and calculating the updated evaluated value. The browse URLfield is indicative of “browse information URL” in FIG. 11. Theprocessing in Step S302 is different from the processing in Step S202according to the first exemplary embodiment shown in FIG. 5A.

-   (3) Step S303

The access count analysis unit 3 confirms whether the time integration(differential) value of the number of accesses of the menu address 11read from the address input unit 1 increases, or not.

-   (4) Step S304

The access count analysis unit 3 increases the evaluated value when thetime differential value of the number of accesses to the menu address 11increases (i.e., decreases or is equal).

-   (5) Step S305

The access count analysis unit 3 decreases the evaluated value when thetime differential value of the number of accesses to the menu address 11does not increase.

-   (6) Step S306

The access count analysis unit 3 calculates the evaluated value in eachof the menu addresses 11, and stores the calculated evaluated value inthe evaluated value storage unit 5. In this time, the access countanalysis unit 3 outputs the evaluated value calculated in each of themenu addresses 11 to the evaluated value storage unit 5 as the latestevaluated value calculation data 14.

-   (7) Step S307

The access count analysis unit 3 confirms whether the menu address 11whose evaluated value is to be calculated remains, or not. When the menuaddress 11 whose evaluated value is to be calculated remains (i.e.,“Yes” in step S307), the access count analysis unit 3 confirms whetherthe menu address 11 whose evaluated value is to be calculated remains,or not. When the menu address 11 whose evaluated value is to becalculated remains, the access count analysis unit 3 confirms whetherthe time differential value ref the number of accesses to the subjectmenu address 11 increases, or not, and repeats the above processinguntil the menu address 11 whose evaluated value is to be calculated iseliminated.

-   (8) Step S308

When the menu address 11 whose evaluated value is to be calculated doesnot remain (i.e., “No” in step S307), the access count analysis unit 3predicts and calculates the evaluated value at time point T3 of therespective menu addresses 11, outputs the updated evaluated value(estimated evaluated value at T3) as the latest evaluated valuecalculation data 14, and stores the updated evaluated value (predictiveevaluated value at T3) in the updated evaluated value storage field ofthe evaluated value storage unit 5. In this example, the evaluated valueprediction unit 32 predicts and calculates the evaluated value at timepoint T3 of the respective menu addresses 11, outputs the updatedevaluated value (estimated evaluated value at T3) as the latestevaluated value calculation data 14, and stores the updated evaluatedvalue (predictive evaluated value at T3) in the updated evaluated valuestorage field of the evaluated value storage unit 5.

-   (9) Step S309

The access count analysis unit 3 confirms whether the reversal of thepredictive evaluated value has been detected, or not. When the reversalof the predictive evaluated value has not been detected (i.e., “No” instep S309), the access count analysis unit 3 completes its processing.In this example, the evaluated value comparison unit 33 confirms whetherthe reversal of the predictive evaluated value has been detected, ornot. The reversal of the predictive evaluated value is directed to astate in which the predictive evaluated value is not arranged in ordercorresponding to the magnitude relation.

-   (10) Step S310

When the reversal of the predictive evaluated value has been detected,the access count analysis unit 3 sets the start signal 12 to an activelevel, and outputs the signal. In this example, the evaluated valuecomparison unit 33 sets the start signal 12 to “1” (the active level),and outputs the signal.

-   (11) Step S311

The menu update unit 6 reads the evaluated value output 15 from theevaluated value storage unit 5, rearranges the menu in order of theevaluated values, stores the updated web page in the web page definitionfield storage unit 7, and outputs the public signal 16 as “1” (theactive level) to the web page publication unit 8.

-   (12) Step S312

The web page publication unit 8 publishes the contents of the web pagedefinition field storage unit 7 on the network because the publishsignal 16 is “1” (the active level)

An example of calculating the evaluated value in the second exemplaryembodiment will be described with reference to FIG. 13. In this example,(T2−T1)=(T3−T2)=1 hour is assumed. Also, it is assumed that the numberof accesses at T3 (the number of accesses at time point T2)+(differencein the number of accesses of (T2−T1)). In this case, the access countanalysis unit 3 calculates the respective predictive evaluated values of“78KOS/KU1+” and “78KOS/KY1+” as follows.

In the second exemplary embodiment, it is assumed that the number ofarticles of the RSS reader of “78 KOS/KU1+” at time point T2 is 10.Also, it is assumed that the number of articles of the RSS reader of “78KOS/KY1+” at time point T2 is 100. In this example, it is assumed thatthe number of articles of the RSS reader is added.

-   (1) “78KOS/KU1+”

The number of accesses at time point T1=400, the number of accesses attime point T2=450, and the number of accesses at time point T3=500.

It is assumed that the evaluated value at time point T1 is 200.

The evaluated value at time point T2: 200+(450−400)/(T2−T1)=250

The evaluated value at time point T3: 250+(500−450)/(T3−T2)+10=310

-   (2) “78KOS/KY1+”

The number of accesses at time point T1=200, the number of accesses attime point T2=400, and the number of accesses at time point T3=600.

It is assumed that the evaluated value at time point T1 is 50.

The evaluated value at time point T2: 50+(300−200)/(T2−T1)=150

The evaluated value at time point T3: 150+(400−300)/(T3 12)+100=350

Because an increase in the evaluated value of “78KOS/KY1+” exceeds anincrease in the evaluated value of “78KOS/KU1+”, the reversal of theevaluated value can be expected at timing of T3. In this time, the menuchange is implemented at timing of Step S310 in FIG. 12B.

In the second exemplary embodiment, because the evaluated value can becalculated by adding together the number of RSS articles associated withnot only the audience's site but also other sites, an evaluated valueclose to a trend can be calculated. The calculated evaluated value isclose to the number of times by which the RSS article of the subjectsite is referred to in fact.

As described above, in the present invention, because there is providedthe access count analysis unit 3 that reflects an increase and adecrease in the number of accesses per time unit in the evaluated value,it is unnecessary to set the priority (priority). For that reason, aninput unit and a storage unit for the priority are unnecessary.

Also, in the present invention, because the menu update start can bealso automatically executed by the access count analysis unit 3according to an increase and a decrease in the number of accesses, nomanual (human) operation is required. That is, the present inventionenables the menu to be automatically updated without troubling anadministrator of the web page.

Also, no web data storage unit for the respective administrators isrequired because no web page (e.g., tree data) is provided for therespective administrators.

Further, the present invention enables the menu to be automaticallyupdated taking into consideration the degree of an increase or adecrease in the number of accesses by a visitor (audience) of the webpage.

In this example, the menu of the web page is described. However, infact, the menu of the web page may be replaced with a menu of a displayscreen for application software, etc., which is operated by a serverside. For example, the menu of the display screen for a CGI (CommonGateway Interface), a servlet, an online game, etc., is conceivable. Inthis case, the address of the web page or URL is replaced with thedescription of a source code related to the menu of the display screen.The access count analysis unit 3 counts the number of times by which themenu of the display screen is selected, at regular intervals, and setsthe number of times as the number of accesses. The access count analysisunit 3 calculates the predictive evaluated value based on the number ofaccesses.

When the predictive evaluated values are not arranged in ordercorresponding to the magnitude relation, the menu updating unit 6rearranges the description of the source code related to the menu of thedisplay screen in order corresponding to the magnitude relation of thepredictive evaluated values, and stores the description in the web pagedefinition field storage unit 7. In this case, if the compiling of thesource code is necessary, the menu update unit 6 rearranges thedescription of the source code related to the menu of the display screenin order corresponding to the magnitude relation of the predictiveevaluated values, and thereafter executes the compiling of the sourcecode, and stores the compiled one in the web page definition fieldstorage unit 7.

The web page publication unit 8 publishes the menu of the display screenfor the application software or the like based on data stored in the webpage definition field storage unit 7. When the web page is used for thedisplay screen, the same as that in the above respective exemplaryembodiments already described is applicable. However, in fact, thepresent invention is not limited to those examples.

That is, the present invention is characterized by calculating thepredictive evaluated value based on “a change in the number of accesseswithin the unit time” with respect to the menu list over the network,and updating the contents of the menus indicated on the menu listaccording to the respective magnitude relation of the estimatedevaluated value. The format of the menu list is not limited to the listformat in which the menus are aligned longitudinally and laterally, butmay be a table format. Even in the case of the table format, it isassumed that the arrangement of the menus is based on the respectivemagnitude relations of the estimated evaluated values. Also, the menusmay be a tab used for changing over a plurality of screens within onewindow. However, in fact, the present invention is not limited to thoseexamples.

In the present invention, when the predictive evaluated value of a givenmenu becomes equal to or lower than 0, or when the predictive evaluatedvalue of the given menu is greatly reduced, the subject menu may not beindicated on the menu list over the network. In this case, it ispossible that the subject menu is deleted from the menu list over thenetwork, and after a given period has been elapsed, the subject menu isindicated in the menu list over the network. It is preferable that thegiven period is a multiple of the unit time. For example, upon receivingthe start signal 12, the menu update unit 6 acquires the predictiveevaluated value from the evaluated value storage unit 5, and deletes thesubject menu from the menu list over the network when the predictiveevaluated value of a given menu is greatly reduced. After 24 hours haveelapsed, the menu update unit 6 updates the menu so as to again indicatethe subject menu in the menu list over the network.

The expression “when the predictive evaluated value of a given menu isgreatly reduced” is directed to a case in which a difference between thepredictive evaluated value immediately before and the present predictiveevaluated value, is equal to or lower than a given threshold value, acase in which the degree of a decrease In the present predictiveevaluated value is larger than that in the predictive evaluated valueimmediately before, or the like. In this case, the menu update unit 6may store the predictive evaluated values at a plurality of continuoustime points in the storage region of the menu update unit 6, or acquirethe predictive evaluated values from the evaluated value storage unit 5through the evaluated value output 15. However, in fact, the presentinvention is not limited to those examples.

When a variation in the predictive evaluated value of the given menu iseliminated for a given period except for the above case, because it ispresumed that the audiences of the subject menu are being fixed, thedisplay position of the subject menu in the menu list may be fixed to aspecific position.

When the variation in the predictive evaluated value of the given menuis slight, it is meant that a change in the number of accesses withinthe unit time is slight. It is predicted that a given number of specificaudiences browse the subject menu periodically.

For example, when a difference between the predictive evaluated valueimmediately before and the present predictive evaluated value is slight,the menu update unit 6 updates the menu so as to set the displayposition of the subject menu in the menu list at the bottom step. Inthis case, the menu update unit 6 may store the predictive evaluatedvalues at a plurality of continuous time points in the storage region ofthe menu update unit 6, or acquire the predictive evaluated values fromthe evaluated value storage unit 5 through the evaluated value output15.

Also, when a variation in the predictive evaluated value of the givenmenu again occurs, the menu update unit 6 may halt a process of fixingthe display position of the subject menu to a specific position, andchange the contents of the menus indicated in the menu list according tothe respective magnitude relations of the predictive evaluated values atthat time point. However, in fact, the present invention is not limitedto those examples.

Although the invention has been described above in connection withseveral exemplary embodiments thereof, it will be appreciated by thoseskilled in the art that those embodiments are provided solely forillustrating the invention, and should not be relied upon to construethe appended claims in a limiting sense.

Further, it is noted that, notwithstanding any claim amendments madehereafter, applicant's intent is to encompass equivalents all claimelements, even if amended later during prosecution.

What is claimed is:
 1. An automatic updating apparatus, comprising: atraffic receiver, as executed by a processor on said apparatus, thatreceives numbers per unit time of accesses of more than one menudisplayed in a screen and calculates rates of variability with respectto numbers of accesses to each menu; and a menu updating unit thatupdates a menu display in the screen based on the rates of variability,wherein the rates of variability comprise derivative values with respectto the number of accesses in an interval which includes at least twounits of time.
 2. The automatic updating apparatus according to claim 1,wherein the menu updating unit changes a display position of the each ofmore than one menu.
 3. The automatic updating apparatus according toclaim 1, the traffic receiver generating a first signal in response toan increase of the rates of variability and notifying the menu updatingunit.
 4. The automatic updating apparatus according to claim 1, furthercomprising a traffic storing unit, wherein the traffic receiver storesthe number per unit time of the accesses of more than one menu in thetraffic storing unit.
 5. An automatic updating apparatus, comprising: atraffic receiver, as executed by a processor on said apparatus, thatreceives numbers per unit time of accesses of more than one menudisplayed in a screen and calculates rates of variability with respectto numbers of accesses to each menu; a menu updating unit that updates amenu display in the screen based on the rates of variability; and anaccess log storing unit that stores the number of accesses to the eachof more than one menu, wherein the traffic receiver acquires the numbersper unit time of the accesses of more than one menu from the access logstoring unit.
 6. An automatic updating apparatus, comprising: a trafficreceiver, as executed by a processor on said apparatus, that receivesnumbers per unit time of accesses of more than one menu displayed in ascreen and calculates rates of variability with respect to the numbersof accesses to each menu; and a menu updating unit that updates a menudisplay in the screen based on the rates of variability, wherein thetraffic receiver acquires a change of the number per unit time of theaccesses of more than one menu based on a second signal received atpredefined intervals.
 7. An automatic updating apparatus, comprising: atraffic receiver, as executed by a processor on said apparatus, thatreceives numbers per unit time of accesses of more than one menudisplayed in a screen and calculates rates of variability with respectto the numbers of accesses to each menu; and a menu updating unit thatupdates a menu display in the screen based on the rates of variability,wherein the traffic receiver comprises a traffic predicting unit thatcalculates the number of accesses on a forward time based on the numberper unit time of the accesses of more than one menu, wherein the trafficreceiver calculates the rates of variability based on the number ofaccesses on a forward time.